12 	zassert_true(!!(n), "Tree check failed: [ " #n " ] @%d", __LINE__)
20 /* Bit is set if node is in the tree */
100 			/* Basic tree requirement */  in check_rbnode()
133  * interior tree and red/black state via internal APIs.
150 	/* Make sure all found nodes are in-order and marked in the tree */  in _check_tree()
164 	/* Make sure all tree bits properly reflect the set of nodes we found */  in _check_tree()
189 void checked_insert(struct rbtree *tree, struct rbnode *node)  in checked_insert()  argument
192 	rb_insert(tree, node);  in checked_insert()
251  * @details Initialize a tree and insert it,
262 	/* Initialize a tree and insert it */  in ZTEST()
267 	zassert_true(rb_get_min(&test_rbtree) == NULL, "the tree is invalid");  in ZTEST()
275 	/* Check if tree's max and min node are expected */  in ZTEST()
276 	zassert_true(rb_get_min(&test_rbtree) == &nodes[0], "the tree is invalid");  in ZTEST()
277 	zassert_true(rb_get_max(&test_rbtree) == &nodes[7], "the tree is invalid");  in ZTEST()