Move from table to tree for lookups

[exim.git] / src / src / tree.c

diff --git a/src/src/tree.c b/src/src/tree.c
index 8f73a46aa65394037f0dc6f5a120a8fae4f70bf0..5cb44b01d822587983970659b8841d2665287998 100644 (file)
--- a/src/src/tree.c
+++ b/src/src/tree.c
@@ -191,7 +191,7 @@ node->balance = 0;
 
 /* Deal with an empty tree */
 
-if (p == NULL)
+if (!p)
   {
   *treebase = node;
   return TRUE;
@@ -214,9 +214,9 @@ for (;;)
   /* Deal with climbing down the tree, exiting from the loop
   when we reach a leaf. */
 
-  q = (c > 0)? &(p->right) : &(p->left);
+  q = c > 0 ? &p->right : &p->left;
   p = *q;
-  if (p == NULL) break;
+  if (!p) break;
 
   /* Save the address of the pointer to the last node en route
   which has a non-zero balance factor. */