Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with tree
Search options not deleted
user 46846
A tree is a graph in which there is exactly one path between any two nodes. It is often used as a hierarchical data structure.
5
votes
Accepted
Binary tree (S-Expression) pretty printer
void print(Tree * tree, bool isRoot)
{
if (! … tree->isNode)
{
printf("%lu", tree->leaf);
return;
};
printf("(");
print(tree->node.left, false);
printf(" ");
print(tree->node.right, false);
printf(")"); …
- 432