A problem on the tree.(DFS,tree,Recursion)

Правка en1, от wish_me, 2017-09-01 07:34:06

A binary tree and a number, say k are given. Print every path in the tree with sum of the nodes in the path as k. (A path can start from any node and end at any node, i.e. they need not be root node and leaf node; and negative numbers can also be there in the tree)

Теги recursion, binary tree, #dfs

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский wish_me 2017-09-01 07:34:06 311 Initial revision (published)