二叉树（叶子结点、层次遍历）递归打印

为什么80%的码农都做不了架构师？>>>   

#include <iostream>
using namespace std;

// binary tree node
struct Node
{
    int data;
    Node *left,*right;
    Node(int x)
    {
        data = x;
        left = right = NULL;
    }
};

int height(Node *root)
{
    if (!root)
        return 0;

    int hLeft  = height(root->left);
    int hRight = height(root->right);

    return ((hLeft > hRight) ? (hLeft + 1) : (hRight + 1));
}

void printGivenLevel(Node *root, int level)
{
    if (!root) return;
    if (level == 1)  cout << root->data << "\t";
    else {
        printGivenLevel(root->left,  level - 1); 
        printGivenLevel(root->right, level - 1);
    }
}

void printLevelOrder(Node *root)
{
    int h = height(root);

    for (int i = 1; i <= h; i++) {
        printGivenLevel(root, i);
        cout<<endl;
    }
}

void printLeaf(Node *root)
{
    if (!root) return;
    if ((!root->left) && (!root->right)) cout << root->data << "\t";
    else {
        printLeaf(root->left);
        printLeaf(root->right);
    }
}

// Driver code
int main()
{
    Node *root = new Node(1);
    root->left = new Node(3);
    root->left->left = new Node(2);
    root->left->right = new Node(1);
    root->left->right->left = new Node(1);
    root->right = new Node(-1);
    root->right->left = new Node(4);
    root->right->left->left = new Node(1);
    root->right->left->right = new Node(2);
    root->right->right = new Node(5);
    root->right->right->right = new Node(2);
    
    cout << "\n------------------------------\n";
    printLeaf(root);
    
    cout << "\n------------------------------\n";
    printLevelOrder(root);
    return 0;
}

 

输出结果:

------------------------------
2	1	1	2	2	
------------------------------
1	
3	-1	
2	1	4	5	
1	1	2	2	

 

转载于:https://my.oschina.net/tsh/blog/860912