Expand_All, Collapse_All to work for nodes

Question

Dear Experts,
currently a report is being displayed using CL_GUI_ALV_TREE which has toolbar buttons like expand_all, collapse_all, select_all, deselect_all .
I have the following tree structure:
Node--> 10001  City   Zipcode
  Leaf **           date   DOJ
  Leaf **           date   DOJ   
Node--> 10002 City   Zipcode
  Leaf **           date   DOJ
  Leaf **           date   DOJ   
Can Someone tell how the above buttons will work
I used Call method tree1-->expand_nodes
but somehow it's not working , actually i am not getting all the node keys of the tree to pass it to the above method.
Is there any example program in the system or anyone have done this and can explain.
Thanks and regards

Answer 1

hi,
see this example....
data:
  begin of fs_spfli,
  expand.
  include structure spfli.
data end of fs_spfli.
data: gr_table type ref to cl_salv_hierseq_table.
data: ispfli like  table of fs_spfli.
data: isflight type table of sflight.
data: ibinding type salv_t_hierseq_binding.
data: xbinding type salv_s_hierseq_binding.
data: gr_functions type ref to cl_salv_functions.
data: gr_columns type ref to cl_salv_columns_hierseq.
data: gr_column type ref to cl_salv_column_hierseq.
data: gr_level type ref to cl_salv_hierseq_level.
select * into corresponding fields of table ispfli from spfli.
select * into table isflight from sflight.
xbinding-master = 'CARRID'.
xbinding-slave = 'CARRID'.
append xbinding to ibinding.
xbinding-master = 'CONNID'.
xbinding-slave = 'CONNID'.
append xbinding to ibinding.
cl_salv_hierseq_table=>factory(
  exporting
    t_binding_level1_level2 = ibinding
  importing
    r_hierseq = gr_table
  changing
    t_table_level1 = ispfli
    t_table_level2 = isflight ).
gr_functions = gr_table->get_functions( ).
gr_functions->set_all( abap_true ).
  gr_columns = gr_table->get_columns( level = 1 ).
  gr_columns->set_expand_column( 'EXPAND' ).  " <=========
gr_level = gr_table->get_level( 1 ).
gr_level->set_items_expanded( ).
gr_table->display( ).<b></b><i></i>
Regards,
  Naresh.